منابع مشابه
An Art Gallery approach to submap meshing
The Art Gallery Theorem and its lemmas have been used since the 1990s in the area of computer graphics to decompose orthogonal polygons into convex sub-regions. This paper extends and improvises Art Gallery concepts to non-orthogonal, generic polygons to perform a multiblock decomposition of faces into a set of maximal, single-loop, convex sub-faces. Concepts such as staircase, dent and notch a...
متن کاملAn Art Gallery Approach to Ensuring that Landmarks are Distinguishable
How many different classes of partially distinguishable landmarks are needed to ensure that a robot can always see a landmark without simultaneously seeing two of the same class? To study this, we introduce the chromatic art gallery problem. A guard set S ⊂ P is a set of points in a polygon P such that for all p ∈ P , there exists an s ∈ S such that s and p are mutually visible. Suppose that tw...
متن کاملthe aesthetic dimension of howard barkers art: a frankfurtian approach to scenes from an execution and no end of blame
رابطه ی میانِ هنر و شرایطِ اجتماعیِ زایش آن همواره در طولِ تاریخ دغدغه ی ذهنی و دل مشغولیِ اساسیِ منتقدان و نیز هنرمندان بوده است. از آنجا که هنر در قفس آهنیِ زندگیِ اجتماعی محبوس است، گسترش وابستگیِ آن با نهاد ها و اصولِ اجتماعی پیرامون، صرفِ نظر از هم سو بودن و یا غیرِ هم سو بودنِ آن نهاد ها، امری اجتناب ناپذیر به نظر می رسد. با این وجود پدیدار گشتنِ چنین مباحثِ حائز اهمییتی در میان منتقدین، با ظهورِ مکتب ما...
A Decentralized Approach to the Art Gallery Problem
With the increasing interest in ubiquitous computing and mobile robotics, distributed algorithms for solving computational geometry problems in a decentralized fashion will grow in importance. This paper describes a mapping of discretized variants of the art gallery problem to a distributed constraint optimization problem. A testbed using several complete, optimal, distributed algorithms is pre...
متن کاملArt Gallery Localization
We study the problem of placing a set T of broadcast towers in a simple polygon P in order for any point to locate itself in the interior of P . Let V (p) denote the visibility polygon of a point p, as the set of all points q ∈ P that are visible to p. For any point p ∈ P : for each tower t ∈ T ∩ V (p) the point p receives the coordinates of t and the Euclidean distance between t and p. From th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2014
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2014.10.393